A weighted group shuffled decoding for low-density parity-check codes

In this paper, we have developed several concepts such as the tree concept, short cycle concept and group shuffling of a propagation to decrypt low-density parity-check (LDPC) codes. Thus, proposed an algorithm based on where probability occurrence takes exponential form factor appearance belief propagation-group shuffled (EFAP-GSBP). This is used for wireless communication applications by providing improved decryption performance with low latency. To demonstrate effectiveness our suggested technique EFAP-GSBP, ran numerous simulations that demonstrated superior traditional BP/GSBP decrypting LPDC codes in both regular non-regular forms